Conditional maximum likelihood timing recovery: estimators and bounds
نویسندگان
چکیده
منابع مشابه
Conditional maximum likelihood timing recovery: estimators and bounds
This paper is concerned with the derivation of new estimators and performance bounds for the problem of timing estimation of (linearly) digitally modulated signals. The conditional maximum likelihood (CML) method is adopted, in contrast to the classical low-SNR unconditional ML (UML) formulation that is systematically applied in the literature for the derivation of non-data-aided (NDA) timing-e...
متن کاملMaximum Conditional Likelihood
We present the CEM (Conditional Expectation Maximization) algorithm as an extension of the EM (Expectation Maximization) algorithm to conditional density estimation under missing data. A bounding and maximization process is given to speciically optimize conditional likelihood instead of the usual joint likelihood. We apply the method to conditioned mixture models and use bounding techniques to ...
متن کاملThe Convergence of Lossy Maximum Likelihood Estimators
Given a sequence of observations (Xn)n≥1 and a family of probability distributions {Qθ}θ∈Θ, the lossy likelihood of a particular distribution Qθ given the data Xn 1 := (X1,X2, . . . ,Xn) is defined as Qθ(B(X 1 ,D)), where B(Xn 1 ,D) is the distortion-ball of radius D around the source sequence X n 1 . Here we investigate the convergence of maximizers of the lossy likelihood.
متن کاملAsymptotic Distributions of Quasi-Maximum Likelihood Estimators
Asymptotic properties of MLEs and QMLEs of mixed regressive, spatial autoregressive models are investigated. The stochastic rates of convergence of the MLE and QMLE for such models may be less than the √ n-rate under some circumstances even though its limiting distribution is asymptotically normal. When spatially varying regressors are relevant, the MLE and QMLE of the mixed regressive, autoreg...
متن کاملCommon Voting Rules as Maximum Likelihood Estimators
Voting is a very general method of preference aggregation. A voting rule takes as input every voter’s vote (typically, a ranking of the alternatives), and produces as output either just the winning alternative or a ranking of the alternatives. One potential view of voting is the following. There exists a “correct” outcome (winner/ranking), and each voter’s vote corresponds to a noisy perception...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2001
ISSN: 1053-587X
DOI: 10.1109/78.912928